Iterated Local Search for Foundry Lotsizing and Scheduling Problem with Setup Costs
نویسندگان
چکیده
منابع مشابه
Iterated local search for the multiple depot vehicle scheduling problem
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...
متن کاملIterated Local Search for the Generator Maintenance Scheduling Problem
We consider the task of devising an effective metaheuristic for a variant of the preventive maintenance scheduling problem (PMSP) — the (power) generator maintenance scheduling problem (GMSP). Recent research on metaheuristics for this problem has made progress on it, but the potential economic benefits of effective methods is significant in this area, and warrants further focused work. We prop...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملImproving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC)
In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. In this work an experimental study was performed to evaluate the intensification and diversification balance between these phases. The results show that the heuristic construction phase has a major impact on the tabu search algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Foundry Engineering
سال: 2017
ISSN: 2299-2944
DOI: 10.1515/afe-2017-0150